package q2169_countOperations;

public class Solution_1 {
    /*
    递归直到有一个数变成0
     */
    public int countOperations(int num1, int num2) {
        if (num1 == 0 || num2 == 0) return 0;
        if (num1 >= num2) return countOperations(num1 - num2, num2) + 1;
        else return countOperations(num1, num2 - num1) + 1;
    }
}
